Edge-connectivity and (signless) Laplacian eigenvalue of graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Seidel Signless Laplacian Energy of Graphs

Let $S(G)$ be the Seidel matrix of a graph $G$ of order $n$ and let $D_S(G)=diag(n-1-2d_1, n-1-2d_2,ldots, n-1-2d_n)$ be the diagonal matrix with $d_i$ denoting the degree of a vertex $v_i$ in $G$. The Seidel Laplacian matrix of $G$ is defined as $SL(G)=D_S(G)-S(G)$ and the Seidel signless Laplacian matrix as $SL^+(G)=D_S(G)+S(G)$. The Seidel signless Laplacian energy $E_{SL^+...

متن کامل

Ela on the Least Signless Laplacian Eigenvalue of Some Graphs

For a graph, the least signless Laplacian eigenvalue is the least eigenvalue of its signless Laplacian matrix. This paper investigates how the least signless Laplacian eigenvalue of a graph changes under some perturbations, and minimizes the least signless Laplacian eigenvalue among all the nonbipartite graphs with given matching number and edge cover number, respectively.

متن کامل

Ela the Smallest Signless Laplacian Eigenvalue of Graphs under Perturbation

In this paper, we investigate how the smallest signless Laplacian eigenvalue of a graph behaves when the graph is perturbed by deleting a vertex, subdividing edges or moving edges.

متن کامل

The smallest eigenvalue of the signless Laplacian

Recently the signless Laplacian matrix of graphs has been intensively investigated. While there are many results about the largest eigenvalue of the signless Laplacian, the properties of its smallest eigenvalue are less well studied. The present paper surveys the known results and presents some new ones about the smallest eigenvalue of the signless Laplacian.

متن کامل

Eigenvalue Bounds for the Signless Laplacian

We extend our previous survey of properties of spectra of signless Laplacians of graphs. Some new bounds for eigenvalues are given, and the main result concerns the graphs whose largest eigenvalue is maximal among the graphs with fixed numbers of vertices and edges. The results are presented in the context of a number of computer-generated conjectures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Linear Algebra and its Applications

سال: 2013

ISSN: 0024-3795

DOI: 10.1016/j.laa.2013.10.017